Surface Normal Integration for Convex Space-time Multi-view Reconstruction
نویسندگان
چکیده
We propose a convex variational approach to space-time reconstruction which estimates surface normal information and integrates it into the photoconsistency estimation as well as into an anisotropic spatio-temporal total variation regularization. As such the proposed method generalizes the works [4], [5]. Although [4] already studied anisotropic regularization they did not estimate normals but used the normals from [2]. The combination of these methods, [4] and [2], is more than 40 times slower than our method as [4] alone needs about 1h to compute a single frame. In contrast, our method only takes about 3 minutes per frame including normal estimation and temporal regularization due to the proposed efficient implementation. Moreover, the method by Kolev et al. [4] does not work well on the 4D data sets we consider, as shown in [5, Fig. 5]. With the estimated normals at hand, we further propose an improvement of the photoconsistency voting scheme by Hernández and Schmitt [1] resulting in superior accuracy especially for sparse camera setups. We represent the space-time surface as a binary interior/exterior labeling function u : V×T 7→ {0,1} and state the spatio-temporal 3D reconstruction task as a minimization problem of the following energy.
منابع مشابه
OSWALD, CREMERS: SURFACE NORMAL INTEGRATION FOR 4D RECONSTRUCTION 1 Surface Normal Integration for Convex Space-time Multi-view Reconstruction
We show that surface normal information allows to significantly improve the accuracy of a spatio-temporal multi-view reconstruction. On one hand, normal information can improve the quality of photometric matching scores. On the other hand, the same normal information can be employed to drive an adaptive anisotropic surface regularization process which better preserves fine details and elongated...
متن کاملExistence Results of best Proximity Pairs for a Certain Class of Noncyclic Mappings in Nonreflexive Banach Spaces Polynomials
Introduction Let be a nonempty subset of a normed linear space . A self-mapping is said to be nonexpansive provided that for all . In 1965, Browder showed that every nonexpansive self-mapping defined on a nonempty, bounded, closed and convex subset of a uniformly convex Banach space , has a fixed point. In the same year, Kirk generalized this existence result by using a geometric notion of ...
متن کاملA Integrated Depth Fusion Algorithm for Multi-View Stereo
In this paper, we propose a new integrated depth fusion algorithm for multi-view stereo. Starting from an embedding space such as the visual hull, we will first conduct robust 3D depth estimation (represented as 3D points) based on image correlation. Next a volumetric saliency weighted normal vector field is constructed from which a watertight 3D surface can be extracted using the graph cut alg...
متن کاملThe Quasi-Normal Direction (QND) Method: An Efficient Method for Finding the Pareto Frontier in Multi-Objective Optimization Problems
In managerial and economic applications, there appear problems in which the goal is to simultaneously optimize several criteria functions (CFs). However, since the CFs are in conflict with each other in such cases, there is not a feasible point available at which all CFs could be optimized simultaneously. Thus, in such cases, a set of points, referred to as 'non-dominate' points (NDPs), will be...
متن کامل3D Reconstruction using Photo Consistency from Uncalibrated Multiple Views
This paper presents a new 3D object shape reconstruction approach, which exploits the homography transform and photo consistency between multiple images. The proposed method eliminates the requirement for dense feature correspondences, camera calibration, and pose estimation. Using planar homography, we generate a set of planes slicing the object to a set of parallel cross-sections in the 3D ob...
متن کامل